Cosmic Ray Report

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43208d45e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43208e3bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43208d6860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43208e1450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43208d5bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43208d0700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43208c5bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43208e3760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4320785e70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43207eed10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43207ea2c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43208e0250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43207c8ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43208c70a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43208df970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4320772080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43207eeb60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4320770190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43207ec7c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43207713f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43207ec0a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4320640cd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43207cb100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f43208e0c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.66s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f250b86d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f250c7b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f250ba830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f250c53c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f250b54b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f24f6a0b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f250b77f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f24f6bbe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f250aa4d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f24f6a0e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f24f4b550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f24f52920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f250b4880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f250ab580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f24fd08e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f24f48640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f24f7b820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f24f48be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f24f57bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f250c2e00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f250c5de0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f24f79540>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f250b4670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8f24f4b940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66cf0610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66cffb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66c0b610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66cfd660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66ce4ee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66b97a60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66ce6dd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66c17730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66b80b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66c16890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66cfbf70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66b8df90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66bb01f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66ce5cf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66cf0400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66ce6530>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66a99f00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66b8dea0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66a9af80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66b82ec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66a9b5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66cedf30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66bb1bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fee66b95960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.56s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082333c5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082334bb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082333e7a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0823349660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082333dc00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082333b220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082332d960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f08231fbb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f08231cedd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f08231f97b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082322ebc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082333de40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082332d150>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f08231cd930>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082332e6b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082322cd60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082332ceb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082309d540>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f08231f9870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082322d6c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0823349e10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f082333ec20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f08231ce080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0823347550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67fe05e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67fefaf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67fe2890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67fed480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67fe1d20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67fd26b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67edfbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67e9da80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67fde7a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67e6eb90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67feda80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67e9eec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67ef78b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67fe84f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67e7b160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67e6e920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67e7a4d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67e6fa30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67e7b4f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67d23a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67e79bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67ef6e60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67fe3c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4b67d9d750>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5f00dde40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5eff74d30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5f00c7340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5eff8fd30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5efffc610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5eff92620>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5eff7b190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5eff723e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5f00c7460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5eff8c880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5eff92f80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5f0e993f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5eff95ff0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5f00c71c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5f00ec280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5f00c70a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5eff7aef0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5effff1c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5eff96d70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5f0001120>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5eff78220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5eff90280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5f0003160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb5eff8ebc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.57s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" - str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9af9d862f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9af9c1c880>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9af9d6f760>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9af9c98400>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9af9d6fdf0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9af9d97b50>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9af9d86710>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9af9c1e6e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9af9d6f3a0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9af9c1ba30>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9af9c7d300>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9afab4d0c0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.40s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e24c850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e25bb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e24b340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e25a6e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e249d80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e23ee60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e0eb8e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e249fc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e14c310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e25a260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e24e320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e1bb3a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e107490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e0eab90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e104dc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e2499c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e168e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e0eaf20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e14ebc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e0e1300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e256590>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e10ef20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e25bca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9a4e14c5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.47s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c40c5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c41bbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c40b7c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c4198a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c409e40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c2db6a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c323010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c2da860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c417640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c2da1d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c2c9480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c2d1870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c2daad0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84d1ccfa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c2d9ba0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c40bdc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c2da2c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c4094b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c1c4910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c1cc730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c1c5630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c3fcdc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c1d1bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fe84c2aa0b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.60s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e290550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e29fbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e28f460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e29d900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e28de40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e1636a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e1a7160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e162890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e1a6770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e161ea0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e139d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e29c520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e178460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e1a6ce0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e135db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e1a7c70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e293520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e283700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e12c880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e13a980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e29ae00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e293490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e2810f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1f8e17bc70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954d345e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954d43af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954d332b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954d41630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954d31c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954c4f700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954c4af20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954bc7700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954d35120>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954bc64a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954c4e950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954d3e4a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954d24df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954c48a60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954d27af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954c4ec80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954a99f90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954d3e7a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954bc8df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954c4bf70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954bcb280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954a99810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954c4a1a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0954c53e20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.56s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53b5c670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53b6bb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53b5b340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53b6a320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53b58bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53a6f040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53b4cfd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53b59300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53a12500>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53b68b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d539f6770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53b64e20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53b6b670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53a77790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53b69ab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53a42ef0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53b4d840>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d538bcfa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53b5d7e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53a42770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53b5cb80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d53a49330>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d538ef910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f0d538c04f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.65s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcdf05e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcdffaf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcdef4c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcdfd810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcdeed10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdccc36d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcd07400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdccc27a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcdf8040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdccc1fc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcd084f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdccd9750>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdccc0280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fddbb1180>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdccc09a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcdee3e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdccc3880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcd0fa00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcca89d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcb714b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcc8e680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcde2170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdcdf8760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4fdccd8be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" * str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f01b3948a60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f01b39577f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f01b3947b50>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f01b3956020>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f01b3946170>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f01b3938e80>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f01b381d330>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f01b3944c10>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f01b394b7f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f01b39478e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f01b3948fd0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f01b46fceb0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.44s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c748cc8b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c748dbaf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c748cf4c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c748d9420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c748cdd20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c748c8940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c7478fa60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c748da9b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c748ca260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c747a6830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c747e1810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c748d9b10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c747647f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c7478f0d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c748bd6c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c747a5570>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c74768910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c747a4160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c7463aad0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c747cbd30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c7476b9d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c748be800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c748cd540>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9c7475fa30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b528760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b537b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b52a8f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b535420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b529de0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b519c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b3c0040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b3c7670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b3ba800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b534a00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b526c20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7c2e9360>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b43d3c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b3c1360>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b3e78e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b5357b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b3e5ae0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b519300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b5295d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b3fc9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b298e20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b528d60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b534df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce7b3c5270>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.59s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f574c550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f575ba90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f574e6e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f575a740>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f574dc60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f5749c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f5740ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f56097e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f563ed40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f560ab90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f5632ce0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f55db1f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f5742590>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f563d900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f5741900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f5633a30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f57414b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f54a9300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f5608a30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f5630220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f560b610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f563a950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f54ebeb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f78f5606bc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf9f1d80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf884a60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf9df250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf886380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf9df610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf90d900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf8a7130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf9dee90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf8ab100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf9defe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf886020>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf883760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf911390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf889420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf8bb9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf889f90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf9f75e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf88a980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf911570>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bfa01870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf90dc00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf881960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf77f400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2bf7b9360>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.70s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838829c730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f83882abb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838829e8c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f83882a93f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8388299540>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838819d090>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838829b970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838819f7c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f83882aba00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838819d030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838812f340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838829d270>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838829aa70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f83882a8730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838819d1e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838812d900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838819e440>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838829d630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838819c5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f83880009d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838819fcd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838828d150>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f838829b730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f83881b0a30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd4f8670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd507bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd4fa8f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd505420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd4f5630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd388910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44ce2a9030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd38a980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd500760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd389690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd3aacb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd3920b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd38a3b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd4ea9b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd388d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd25fb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd388850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd25c5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd3881c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd3b8250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd392020>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd3fb7f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd4f8760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f44cd3978e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.65s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" / str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa8e0eba230>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa8e0d50970>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa8e0ea3820>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa8e0dcc370>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa8e0ea3310>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa8e0ecb820>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa8e0eba8c0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa8e0d525f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa8e0ea2a70>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa8e0d4f010>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa8e0dcdba0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa8e0daa3e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.35s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd8744c45e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd8744d3af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd8744c68c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd8744d1480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd8744c5d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd8744b66b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd874373550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd874382650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd8744c2ce0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd874350fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd8744d2f50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd874382da0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd8743dbca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd8744ccd90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd87435edd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd874353af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd87435de70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd8744b5630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd87435f940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd874257430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd87435f2b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd8743df730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd8744b7b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd8744d1a80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.47s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be1450670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be145fb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be1452650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be145d4b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be1451bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be144f4f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be1445990>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be12ffbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be1342f80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be12feaa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be12e8b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be1452170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be1447e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be1341a50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be1445ff0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be12e9840>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be1445420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be1343100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be1446fe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be11bb700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be1446620>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be1459cc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be12ef370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1be12e9a20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.65s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586aa005e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586aa0fbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586aa02890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586aa0d450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586aa01c00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a9fc700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a9f2e30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586aa0d660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a8ed900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a917640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a8c3e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586aa0c160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a8cd390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a9f3250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586aa09c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a89e0b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a915120>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a89c610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a9153f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a89c850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a914bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a768520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586a8cc310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f586aa0e380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42b085b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42b17a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42b0a740>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42b154e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42b09c00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42b071c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42b0a740>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42afbd60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b429c6980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42afbfd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42b05de0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42a19240>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42b09660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b429c5de0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42b14f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b429cb310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42b14af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b429a2290>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42b15600>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b429a36a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b42b17010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b429a2140>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b429cadd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b428679a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.57s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b57c5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b58bb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b57e830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b5891e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b57dc00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b423700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b586d10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b423460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b57fd90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b421810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b5799f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b448e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b57a380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b56dd50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b579060>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b56d000>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b4180a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b57ec20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b418ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b492500>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b56de10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b4185b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b578d30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6c0b33fd60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7d38730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7d47b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7d3a8f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7d453f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7d35540>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7c391b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7d37a60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7c3b760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7d47ee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7c3b580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7bc9960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7d39d20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7d35cf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7d46f20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7c390c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7bc9780>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7c3b160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7d44ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7c38550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7bfbac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7d348b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7d422c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7d38160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcce7bd72b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.56s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" // str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f08648e09a0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f08648ef820>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f08648e2920>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f08648ed300>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f08648e1f00>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f08648d1b40>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0864772800>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0864799ed0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f08647731f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0864799900>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f08647710f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0864799f60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.37s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1bac5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1bbbb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1bae7a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1bb9420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1baef50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1bab550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1b9ed70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1ac7bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1a3ee30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1ac5960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1bb6590>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1bad5a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1b9fe20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1a3d900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1b9dfc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1a588b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1bab070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1bb87f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1baa950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1a5be80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1ac2680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1ba9960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd190bac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fccd1a44cd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.46s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df614550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df623af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df616890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df6215d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df615cf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df613220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df60ae00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df533c10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df4db280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df5316c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df61c610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df6161d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df609270>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df4d9930>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df60b3d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df4ad000>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df622cb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df616a10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df4d7100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df4ac1f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df4d7880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df5334f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df3f3c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f62df610c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164ea7c550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164ea8bb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164ea7e830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164ea89450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164ea7dcf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164ea7b8b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164ea6d150>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164e973a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164e942b00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164e971780>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164e92ec50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164ea7c310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164ea6ee00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164e941b70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164ea6ed40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164e92d270>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164ea6fdf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164e7e12a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164e972470>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164e92c610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164ea8bca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164ea7c460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164e942380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f164ea851e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6f445e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6f53b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6f46770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6f51660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6f45bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6f431f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6f35ab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6e0bb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6e36f50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6e09720>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6ddcbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6f45f00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6f36950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6e35870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6f36ce0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6ddf7f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6f35b10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6ca9630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6e088b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6dddc30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6f53850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6f47ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6e363e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f52a6f4fc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.60s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f586195c610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f586196bb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f586195f250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f58619693f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f586195dae0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f58619588b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5861967880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f586180bfa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f586195fb80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f586180a5f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5861959060>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5861800070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f58617f82e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f58617f6e60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f586196bd30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5861959f60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5861874df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f58619668f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f58617efd00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f58616c0970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f58617ed750>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f58618761a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5861965810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f58617edba0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d738550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d747b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d73b370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d745420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d739c00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d734910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d741510>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d5efa60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d7390c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d5ee6e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d734fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d651f90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d5d76d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d63ba90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d5d6080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d7356c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d6005b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d741480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d5c87f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d49c7c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d5cb880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d602170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d5edc90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb67d72cd90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" % str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f6635f64a30>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f6635e03700>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f6635f66920>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f6635e01180>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f6635f65e70>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f6635f56740>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f6635df6530>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f6635e7cf10>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f6635e142e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f6635e7fc10>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f6635e154e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f6635e7f0a0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.36s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf074985e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf074a7bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf0749a890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf074a5450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf07499c00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf07494700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf07489bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf074a7760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf07345e70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf073aac80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf073acbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf074a42b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf07328730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf0748b1f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf074a2da0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf07331570>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf073aabc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf07333fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf073a9060>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf073313f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf073a80a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf071fce50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf0732b3a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdf074a6e60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.48s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cf0c5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cf1baf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cf0e860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cf19450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cf0dcc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cf0b580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cefd930>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cf198d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cda65c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991ce22710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991ce26290>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cf18400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cdd4760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cefe3e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cf16da0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cdaaa70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991ce23ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cdabb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991ce23a60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cda9150>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991ce20940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cc7cd60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cdd4d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f991cf19720>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484eac5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484ebbaf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484eae770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484eb9420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484eadc00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484ea8a60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484e9da50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484d43b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484d7edd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484d40340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484d5ab30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484eadea0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484e9e5f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484d7df90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484e9edd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484d59cf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484e9dae0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484c11930>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484d41330>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484d5a5c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484eba0b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484eaeb90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484d7efb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2484eb6590>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.58s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9d54670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9d63bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9d566b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9d614b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9d55bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9d50a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9d45900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9d628f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9c51630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9c69780>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9c10d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9d5fc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9d52530>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9bed660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9d51570>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9be25f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9d5c130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9afc850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9be4e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9afe9e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9be6440>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9d52380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9c510c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57d9d56800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec1f8670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec207bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec1fa920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec205420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec1f5630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec0849d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ecfad030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec086980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec200760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec087010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec0a6ce0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec08e0e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec085420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec1ea9b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec086080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ebf540a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec0857e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ebf54940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec0868f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec0b51b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec1f52d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ec085300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ebf93070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f02ebf7b010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc1d8700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc1e7b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc1da830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc1e5570>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc1d5390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc0f7610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc1d6500>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc0f6350>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc1e7b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc0f5c00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc06a2f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc1d9b70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc1d6860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc1e5360>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc0f5ba0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc06b5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc0f4820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccbf89e10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc0f5f60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccbf3f340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc0f6260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccc1d4a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccbf8ac20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ccbf82ec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" ** str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fddf38ecaf0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fddf38fb850>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fddf38ee740>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fddf38f90f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fddf38eddb0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fddf38e1870>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fddf38f80d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fddf37b5960>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fddf38fa170>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fddf3807610>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fddf37e3310>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fddf37b65f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.36s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727bc05e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727bcfbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727bc2890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727bcd480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727bc1d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727bbc7f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727bb2e30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727bcd660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727a719c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727adb220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727a80640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727bcc940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727a87640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727bb3b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727bc9c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727a5d2d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727adac50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727a5c370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727ad81f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727a5cfa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727ad84f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727930400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727a87160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3727bce950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.47s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4837246a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb483733b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb483726920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4837313f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4837213c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4835d6080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb483723970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4835d7bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb483715ab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4835d7eb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4835b6980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4835bce50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb483720730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb483717760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb48363c9d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4835b6fe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4835e6bc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4835b7940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4844d90c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb48372e680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb483732470>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4835e7b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4837218a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb4835b4610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.58s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e706a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e7fb80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e72620>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e7d480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e71b70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113d248b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e78130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113d25720>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e73be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113d26770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e6ec20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113d14f40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e6da20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e65cc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e6cd90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e64ee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113d0d300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e72c80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113d0ea10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113d30b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e67e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113d0ded0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113e6e920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa113c084f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c30610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c3fa90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c32680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c3d3f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c31ae0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c2f850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c32320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c27eb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9af2bf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c25ed0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c2da20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9ae3b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c33e20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9af1990>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c3f490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9ad5b10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c3f760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9acc730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c3d660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9acda20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c3cf10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9c25b40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9ace320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2c9997340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab5e06a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab5efb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab5e2920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab5ed4e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab5dd3c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab46c8b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ac395030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab46f580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab5e9b70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab46f1f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab48fc70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab476710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab46d630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab5d1600>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab46ff70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab33f5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab46f760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab33f880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab46c730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab4f6140>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab474550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab499030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab5e15a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42ab4789a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.56s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb077461e40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0772f8d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb07744b340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb077317c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0773806a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb077311d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0772fef80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0772f63e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb07744a920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0773143a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb077310f40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb07821cfa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb077319c90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb07744b8b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb077473dc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb07737fe20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb077473010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb077466c20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb077472aa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0771cc100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb07744ad10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb07731b430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0772fe3b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb077472d70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" >> str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f25bd7e4a60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f25bd7f3820>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f25bd7e6770>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f25bd7f1300>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f25bd7e16c0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f25bd682fb0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f25bd6d8400>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f25bd7e69b0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f25bd7f30d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f25bd7d9720>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f25bd7f2e90>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f25bd7d9b40>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.36s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c7f85e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c807af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c7fa8c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c805480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c7f9d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c7ee6b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c6ab550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c6b9f30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c7f69b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c688370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c805990>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c6bada0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c713f40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c8f44c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c7f5000>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c689a20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c7f4f40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c68b550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c7f4970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c6cbbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c7f6bf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c5a4160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c5cbe50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff95c5c1450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.47s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cea07f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0ceafb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cea28f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0ceae3b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cea1d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0ce9cd00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cd9fa00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0ceaeb60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0ce9e260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cd72b90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cdb1cc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0ceaf580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cd55030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cd9d900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0ce92800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cd724a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cdb20b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cd9fe20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cd393f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cc00460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cdb1390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cd57c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cea2590>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7b0cead390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba766945e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba766a3af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba766967a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba766a1510>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba76695c90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba766939a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba76685900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba766a13f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba76581870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba765a9c30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba76554100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba7669ffd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba765aa350>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba76532230>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba765a8be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba76527340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba766849d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba763f4d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba76560c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba76527760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba76561720>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba76693e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba765a8b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fba7644a470>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.60s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f66a45e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f66b3b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f66a67d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f66b1660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f66a5c30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f66a3220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f6699960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f65c3b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f656add0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f65c0070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f653cc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f66a58d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f66991e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f6569e10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f6699ab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f653fa60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f6699810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f64094b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f65c0640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f653f250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f66b2770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f66a4490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f656b1f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f54f66ac370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf488760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf497b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf48a920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf4953f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf489d80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf479c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf337820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf327670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf31a7d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf497370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf486230>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf325ed0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf349990>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf3354e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf37f640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf496a10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf37e380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf47a230>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf4887c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf354d60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf37d2a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf34bb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf4914b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6bcf488850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.56s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b59dc90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b434850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b5872e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b436260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b587850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b4bd780>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b59dde0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b4312a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b4c0340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b4327a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b438d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b477b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b5ac6d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b4c9660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b5adc90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b586560>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b43bc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b4be1a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b5ac7c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b4c8670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b5a3610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b431480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b4c88e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc21b4c0310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.67s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" << str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6e8d0209a0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6e8d02f8b0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6e8d022950>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6e8d02d2d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6e8d021ff0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6e8d012710>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6e8ceb36d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6e8cf11ea0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6e8ceb3820>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6e8cf117e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6e8ceb1240>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6e8cf11c30>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.40s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9298d85e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9298e7af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9298da830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9298e5450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9298d9c90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9298d7580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9298cae00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9298e5870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb929771ea0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9297f2c80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb929799570>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9298e4160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9297a3bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9298cb400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9298e1c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9297762c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9297f3580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb929776f50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9297f0ee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb929774a00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9297f0d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb929648040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9297a1210>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb9298e6c20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3330619e40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33304b0d30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33306033d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33304cfd00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3330538550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33304d1f00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33304b6da0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33304ae650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3330602170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33304cd780>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33304d3070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33313d4fa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33304d5c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3330603b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3330629180>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f333053e110>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f333062bc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f333061cee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f333062a890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3330386b60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f333062b2b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33303dc820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f333061dbd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33304b1570>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73638f05e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73638ffaf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73638f2890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73638fd480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73638f1d20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73638e26b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7363788430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73637b1a80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73638ee7a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7363782b90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73638fd1b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73637b2ec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f736380b8b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73638f84f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f736378d1e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7363782920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f736378e4d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7363780d30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f736378d5d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f736379fa90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f736378dbd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f736380ae60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73638f3c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73636b5750>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1106247c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb110633a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb110626800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1106314e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb110625ea0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb110623100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11053b7f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1106329b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb110622080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1104fa9b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb110541c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1106334f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1106264d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11053a740>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1104d3880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1104fb610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb110540f40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11053b820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1104c1120>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11038dd80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11062da50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb110626fe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb110620a60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb110515b40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e4211e40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e40a8b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e41fb2b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e40c7d60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e41308b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e40a7520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e41faa10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e4212950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e40a9cf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e40a22c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e41fa770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e40c7ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e40afa00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e40a7640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e42233a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e40a4910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e41fb2b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e40a5030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e3f8b1c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e40a0be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e3f8b430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e410d240>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e41373d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe1e41faad0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c30c5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c31bb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c30e8c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c319420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c30dd20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c30b610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c3019c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c3196f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c1a6500>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c226620>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c1cd5a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c31b670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c1d4b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c302fe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c315c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c1aa0b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c224f70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c1a8040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c2253c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c1a9810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c225090>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c078700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c1d7fa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f747c3195d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.56s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" | str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2241fc4a30>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2241e636d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2241fc7880>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2241e62050>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2241fc5ff0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2241fb6740>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2241e567d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2241e85930>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2241e6c250>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2241e87d00>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2241e6e080>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2241e85b10>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.35s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac36a645b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac36a73af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac36a66920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac36a71450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac36a65db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac36a566b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac368fc430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac36925c30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac36a62e00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac368f6b00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac36a719c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac36926da0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac3697d4e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac36a6cac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac369008e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac36a71450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac36924880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac368131f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac368feb60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac36811ea0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac368feec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac369251b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac368f5780>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fac3697d030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fbc86d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fbd7c10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fbca860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fbd54b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fbc5360>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fac9060>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fbc6a10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152facb040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fbb9390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152facbe80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fa8b970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fae2080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fbcace0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fbbb400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fbcab30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fa59240>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fbc9e40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fa79ab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fa89360>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fa783d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fa8bf10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fa66260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fa5a470>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f152fae3880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.64s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19464700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19473b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed194668c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed194713f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19461510>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19383610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed194638b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed193823e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19473a00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19381d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed192f7670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19464b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19461cf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed194707c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19381de0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed192f5900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed193812a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19465750>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19380f40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed191c8850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19382b00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19454fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19463df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed19379390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.56s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd0638550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd0647b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd063a830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd06453f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd0639cc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd0637a00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd062dab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd04ebbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd04d2e30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd04e96f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd04e6ce0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd0639360>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd062eaa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd04d1ea0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd062e710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd04e51e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd062d030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd039d630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd04eab00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd04e4190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd0644d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd063abf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd04d20e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5bd0643e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa72f45e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa7303b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa72f6890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa7301420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa72f5cf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa72f35e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa72e6e30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa7301660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa71a5840>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa720e6e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa71b6800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa73031c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa71b8bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa72e7010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa72fdc60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa7193190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa720f9d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa7192e30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa720f4c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa7191060>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa720c610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa7061a20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa71b92d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5aa73039a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f263c0700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f263cfb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f263c28c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f263cd3f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f263bd510>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f262720b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f263bf8b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f26273af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f263cfc70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f26272170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f26253340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f263c0b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f263bc5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f263cf010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f26273550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f26252ef0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f26270490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f263c3280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f262712d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f26124af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f26273d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f263b3af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f263be410>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0f262d9270>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.64s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" & str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5f26f48a30>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5f26de36d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5f26f4b7c0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5f26de1150>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5f26f49fc0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5f26f39b70>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5f26dd6770>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5f26e05720>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5f26e1c220>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5f26e07070>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5f26e1d570>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5f26e06860>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.36s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df461c670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df462bbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df461e950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df46296c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df4619630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df44a89a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df53d1030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df44ab460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df4624ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df44a8460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df44b3e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df450da80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df44a9ab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df460fac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df44a8880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df437fb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df44a8910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df437ce50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df44abee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df44d8490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df450ec20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df44cbd90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df461fca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4df44b43d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.47s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8c30640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8c3fb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8c32680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8c3d3f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8c31ab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8c2f160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8c3bd00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8c2ed10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8c33dc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8c2d1b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8af9ed0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8acfee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8b48e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8ae37c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8c3ebc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8afb250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8c2e320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8accf40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8af6c20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8ae2f80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8af4640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8c2dcf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8c389a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f37e8af8850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.59s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f810213c640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f810214baf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f810213e530>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8102149420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f810213dab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f810213b010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8102132dd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8101ffd9f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8101ffb2b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8101ffea10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8101fd4550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8101fcea10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8102131de0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8101ff9210>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8102131810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8101fd7670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8102131630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8101ea1300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8101ffe350>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8101fd4970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8101ffdff0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8101fdbc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f81021307f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8102145870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c3420670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c342fb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c34228f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c342d3f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c341d390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c32b23e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c41e1030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c32b3550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c3428760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c32b0670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c32d2d40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c32ba740>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c32b14b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c34127d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c32b08b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c3187b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c32b1180>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c3184e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c32b0790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c32e1360>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c32bab90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c33238e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c3421540>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f60c32bee00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.67s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc6804805e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc68048faf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc680482800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc68048d450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc680481c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc68047f550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc680471960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc68048d870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc680331870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc68039ad10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc680340640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc68048b490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc68039ab90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc68031db40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc680398d30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc680310ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc680472380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc6801e8ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc680317e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc6803132b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc680315390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc68047e590>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc68039b250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc680222ad0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f80349945e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f80349a3af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8034996800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f80349a1450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8034995c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8034993550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8034989960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f80349a1690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8034845870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f80348aed10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8034854640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f803499f490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f80348aeb90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8034831b40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f80348acd30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8034824ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f803498a380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f80346fcca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f80348cbe50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8034826cb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f80348c9480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f80349938b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f80348aebc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8034736860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.60s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" ^ str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9e70678a60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9e706877f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9e7067a6b0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9e706854e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9e706754e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9e70516a10>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9e705382e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9e7067a920>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9e70687850>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9e706789a0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9e70686e60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f9e7067bc70>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.38s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value + target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.15s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value + target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.19s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value + target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.19s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value * target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.18s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value * target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.18s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value * target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.18s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value / target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FF.................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F...... [ 62%]
.......F......FF....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 106 passed in 0.32s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value / target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FF.................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F...... [ 62%]
.......F......FF....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 106 passed in 0.34s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value / target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...............F....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value / target)
E               ZeroDivisionError: division by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value / target)
E               ZeroDivisionError: division by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value / target)
E               ZeroDivisionError: division by zero

binarySearchTree1.py:143: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 3 failed, 114 passed in 0.20s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value // target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FF.................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F...... [ 62%]
.......F......FF....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 106 passed in 0.33s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value // target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FF.................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F...... [ 62%]
.......F......FF....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 106 passed in 0.32s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value // target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...............F....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value // target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value // target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value // target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 3 failed, 114 passed in 0.23s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value % target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FF.................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F...... [ 62%]
.......F......FF....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 106 passed in 0.31s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value % target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FF.................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F...... [ 62%]
.......F......FF....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 106 passed in 0.33s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value % target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...............F....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value % target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value % target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value % target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 3 failed, 114 passed in 0.20s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value ** target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value ** target)
E       ZeroDivisionError: 0.0 cannot be raised to a negative power

binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
======================== 1 failed, 116 passed in 0.21s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value ** target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value ** target) < distance:
E           ZeroDivisionError: 0.0 cannot be raised to a negative power

binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
======================== 1 failed, 116 passed in 0.19s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value ** target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value >> target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value >> target)
E       ValueError: negative shift count

binarySearchTree1.py:140: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
======================== 1 failed, 116 passed in 0.19s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value >> target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value >> target) < distance:
E           ValueError: negative shift count

binarySearchTree1.py:142: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
======================== 1 failed, 116 passed in 0.21s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value >> target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value << target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value << target)
E       ValueError: negative shift count

binarySearchTree1.py:140: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
======================== 1 failed, 116 passed in 0.19s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value << target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value << target) < distance:
E           ValueError: negative shift count

binarySearchTree1.py:142: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
======================== 1 failed, 116 passed in 0.19s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value << target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.22s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value | target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value | target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.18s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value | target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value & target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value & target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value & target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value ^ target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value ^ target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value ^ target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.17s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -102,7 +102,7 @@
         if self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
-        while n.left != None:
+        while n.left is None:
             n = n.left
         return n.value
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....F.. [  5%]
.........F....F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
....F..............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F...F.................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:38: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f7e63fbc670>

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:143: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:149: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f7e63e62d10>

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L: True R:)'
>       var_6 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:112: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is True
>       var_2 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:200: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 7 failed, 110 passed in 0.27s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -111,7 +111,7 @@
         if self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
-        while n.right != None:
+        while n.right is None:
             n = n.right
         return n.value
     

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FFF.FF.FFFFFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
......F............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F..FFFFF.FF.FFFFF.FFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:95: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:106: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:145: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:166: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:288: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:307: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:350: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: True R:)) 3380 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
>       assert var_6 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:390: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f9c29748760>

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:148: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:185: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: binary:() R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:246: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:278: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:312: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
>       assert var_7 == 1625
E       assert -2656 == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:464: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
>       var_8 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:492: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
        var_1 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:44: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f9c2963f130>

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:176: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 38 failed, 79 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val == self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ....FF.F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF.....F.........                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'X>'
        str_1 = 'qkr(Szzyf\t'
        binary_node_0 = module_0.BinaryNode(str_1)
        var_0 = binary_node_0.remove(str_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:54: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
======================== 13 failed, 104 passed in 0.32s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target == node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...F.FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......FF...........F..                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
.........FF...F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 20 failed, 97 passed in 0.34s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) == distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target == node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
..............F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 5 failed, 112 passed in 0.24s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val != self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....................F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
======================== 1 failed, 116 passed in 0.19s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target != node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
....................F..F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...................FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = var_5.__repr__()
        assert var_6 == 'True'
        var_7 = binary_tree_0.__contains__(var_3)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:336: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 5 failed, 112 passed in 0.24s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) != distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.17s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target != node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...............FF.....FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.................F..F.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
======================== 6 failed, 111 passed in 0.29s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val <= self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ....F..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF...............                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
======================== 11 failed, 106 passed in 0.34s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target <= node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.......F.........FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 22 failed, 95 passed in 0.40s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) <= distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.17s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target <= node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.15s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val > self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....................F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .....F...... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
........F.........                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'X>'
        str_1 = 'qkr(Szzyf\t'
        binary_node_0 = module_0.BinaryNode(str_1)
        var_0 = binary_node_0.remove(str_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:54: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
======================== 3 failed, 114 passed in 0.21s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target > node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
....................F..F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......F............FF.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FF.......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = var_5.__repr__()
        assert var_6 == 'True'
        var_7 = binary_tree_0.__contains__(var_3)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:336: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
======================== 7 failed, 110 passed in 0.24s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) > distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target > node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............FFF.....FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
..............F.....F.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 10 failed, 107 passed in 0.27s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val >= self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ....FF.F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF.....F.........                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'X>'
        str_1 = 'qkr(Szzyf\t'
        binary_node_0 = module_0.BinaryNode(str_1)
        var_0 = binary_node_0.remove(str_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:54: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
======================== 13 failed, 104 passed in 0.39s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target >= node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...F.FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......FF...........FF.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
.........FF...F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 21 failed, 96 passed in 0.34s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) >= distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target >= node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............FFF.....FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
..............F.....F.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 10 failed, 107 passed in 0.30s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val is self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ....FF.F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF.....F.........                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'X>'
        str_1 = 'qkr(Szzyf\t'
        binary_node_0 = module_0.BinaryNode(str_1)
        var_0 = binary_node_0.remove(str_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:54: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
======================== 13 failed, 104 passed in 0.35s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target is node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...F.FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......FF...........F..                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
.........FF...F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 20 failed, 97 passed in 0.34s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) is distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.17s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target is node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
..............F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 5 failed, 112 passed in 0.22s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val is not self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....................F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
======================== 1 failed, 116 passed in 0.19s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target is not node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
....................F..F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...................FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = var_5.__repr__()
        assert var_6 == 'True'
        var_7 = binary_tree_0.__contains__(var_3)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:336: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 5 failed, 112 passed in 0.25s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) is not distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.18s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target is not node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...............FF.....FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.................F..F.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
======================== 6 failed, 111 passed in 0.24s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val == self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....................F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...............F.FF.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert 427 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 6 failed, 111 passed in 0.27s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val != self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F...... [  5%]
..F.......FFFF.FFF..FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py FF..F..F.F.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF........F...FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: True R:) False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 34 failed, 83 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val < self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F...... [  5%]
..F.......F....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .F..F..F.F.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
...F.........F........                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF........F......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:(L: F...(L: True R:))' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         ?                       ---      ---------
E         + binary:(L: False R:(L: True R:))

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L... R:) True R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         ?                       ^^^         ----------
E         + binary:(L:(L: False R:) True R:)
E         ?                       ^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:(L: -...L: True R:)))' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         ?                                   ---     ---------
E         + binary:(L: -4493 R:(L: False R:(L: True R:)))

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 17 failed, 100 passed in 0.35s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val > self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F...... [  5%]
..F.......FFFF.FFF..FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py FF..F..F.F.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF........F...FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 34 failed, 83 passed in 0.48s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val >= self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...........FFF.FF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py F......F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
...............FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 23 failed, 94 passed in 0.59s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val is self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....................F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...............F.FF.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert 427 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 6 failed, 111 passed in 0.27s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val is not self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F...... [  5%]
..F.......FFFF.FFF..FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py FF..F..F.F.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF........F...FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: True R:) False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 34 failed, 83 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val == self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...........FFF.FF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py F......F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
...............FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 23 failed, 94 passed in 0.47s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val == self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ..F.F..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F......F                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF..............F                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.remove(bool_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:25: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
        var_0 = binary_node_0.remove(int_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:226: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
======================== 14 failed, 103 passed in 0.28s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target == node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...FFF.                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.......F.........FF...                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 18 failed, 99 passed in 0.37s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target == node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.........F..............                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert 451 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 2 failed, 115 passed in 0.18s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val != self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.28s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val != self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target != node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target != node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.17s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val < self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...........FFF.FF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py F......F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
...............FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 23 failed, 94 passed in 0.47s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val < self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....................F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ..F......... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
..................F..F                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.................F                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...R:)) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         ?               ^^^^        ^^^^
E         + binary:(L:(L: True R:(L: 3380 R:)) 3380 R:)
E         ?               ^^^        ^^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.remove(bool_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:25: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert 1625 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
        var_0 = binary_node_0.remove(int_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:226: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
======================== 5 failed, 112 passed in 0.26s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target < node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F.............                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:170: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
======================== 1 failed, 116 passed in 0.18s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target < node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.........F..............                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert 451 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 2 failed, 115 passed in 0.20s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val <= self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...........FFF.FF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py F......F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
...............FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 23 failed, 94 passed in 0.43s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val <= self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ..F.F..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F......F                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF..............F                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.remove(bool_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:25: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
        var_0 = binary_node_0.remove(int_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:226: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
======================== 14 failed, 103 passed in 0.35s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target <= node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...FFF.                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.......F.........FF...                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 18 failed, 99 passed in 0.44s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target <= node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.........F..............                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert 451 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 2 failed, 115 passed in 0.20s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val >= self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val >= self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ....F..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF...............                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
======================== 11 failed, 106 passed in 0.30s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target >= node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.......F.........FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 22 failed, 95 passed in 0.37s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target >= node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.17s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val is self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...........FFF.FF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py F......F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
...............FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 23 failed, 94 passed in 0.42s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val is self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ..F.F..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F......F                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF..............F                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.remove(bool_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:25: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
        var_0 = binary_node_0.remove(int_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:226: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
======================== 14 failed, 103 passed in 0.33s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target is node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...FFF.                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.......F.........FF...                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 18 failed, 99 passed in 0.46s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target is node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.........F..............                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert 451 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 2 failed, 115 passed in 0.20s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val is not self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val is not self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target is not node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target is not node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -22,7 +22,7 @@
 
     def addToSubTree(self, parent, val):
         """Add val to parent subtree (if exists) and return root of that subtree."""
-        if parent is None:
+        if parent is not None:
             return BinaryNode(val)
 
         parent.add(val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F.F.... [  5%]
..F......FFFFF.FFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py FF..F..F.F.. [ 36%]
...F...............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py FFF........ [ 62%]
F..F.F...FFFFFFFFFFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
.FF........F...FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
>       var_0 = binary_node_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:9: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 442 R:), parent = None, val = 442

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:25: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:75: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
        assert var_9 == 'binary:(L: False R:)'
>       var_10 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = 451

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
>       var_6 = binary_tree_0.add(var_5)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:171: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:182: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:194: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:212: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:247: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:269: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:287: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:304: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:330: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:346: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 3380 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:385: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -4493 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:10: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:139: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: binary:() R:), parent = None, val = 'binary:()'

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:11: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:29: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        object_0 = module_1.object()
        var_3 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:43: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:107: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:133: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:224: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
>       var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:239: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: None R:), parent = None, val = (L: None R:)

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        object_0 = module_1.object()
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:262: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_5).__module__}.{type(var_5).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:281: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:289: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:317: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:337: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
>       var_3 = binary_node_0.addToSubTree(var_2, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:360: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:388: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:412: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:439: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:457: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -2656 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:483: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 1656 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.add(list_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:29: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: [] R:), parent = None, val = []

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       var_1 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:55: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       var_1 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:71: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:209: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -995 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:216: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 47 failed, 70 passed in 0.94s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -37,7 +37,7 @@
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
-            if self.left is None:
+            if self.left is not None:
                 return self.right
 
             child = self.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
....F.....F.F........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ...FF..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF.....F....FF.FF.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF...............                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_11 _________________________________

    def test_case_11():
        bool_0 = False
        list_0 = [bool_0, bool_0]
        binary_node_0 = module_0.BinaryNode(list_0)
>       var_0 = binary_node_0.remove(list_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:87: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: [False, False] R:), val = [False, False]

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.add(var_5)
>       var_7 = binary_tree_0.remove(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:198: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L:(L: True R:) True R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:33: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:104: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
>       var_2 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:124: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
        assert var_5 == 427
>       var_6 = binary_tree_0.remove(var_5)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 427 R:), val = 427

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:314: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
>       var_7 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:342: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 427 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
>       var_5 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:391: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 427 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
>       var_3 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:416: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:(L: 1625 R:)), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
>       var_8 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:465: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 1625 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:54: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:70: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
======================== 20 failed, 97 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -87,7 +87,7 @@
    
     def add(self, value):
         """Insert value into proper location in Binary Tree."""
-        if self.root is None:
+        if self.root is not None:
             self.root = BinaryNode(value)
         else:
             self.root.add(value)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F.F.. [  5%]
.FF..FFF.FF.FFFFFFFFFFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ..........FF [ 36%]
FF.FF.F.FF.F.F..F..                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .FF.F...... [ 62%]
F.FFFFFF.FFFFFFFFFFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .FFF [ 84%]
.........FFF..F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:23: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:36: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        var_1 = binary_tree_0.__repr__()
        assert var_1 == 'binary:()'
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:65: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:73: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:104: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:119: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:140: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:190: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:208: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
>       var_3 = binary_tree_0.add(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:225: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:243: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:265: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:285: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:302: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:318: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:326: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:344: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 3380

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:365: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:383: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = -4493

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:115: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:120: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:125: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:137: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:147: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
>       var_0 = binary_tree_0.add(set_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:174: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = {binary:()}

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        bool_0 = True
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:192: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:217: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:27: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:39: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:55: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:100: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:146: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:158: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:171: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:183: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:197: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:220: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:244: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:257: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:275: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:293: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:309: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:333: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
>       var_4 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:365: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:382: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:408: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:433: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
>       var_1 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:452: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = -2656

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:481: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 1656

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:21: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(list_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:27: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = []

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
>       var_1 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:42: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:128: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:147: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:170: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:195: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_10
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 63 failed, 54 passed in 0.96s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -99,7 +99,7 @@
 
     def getMin(self):
         """Returns minimum value."""
-        if self.root is None:
+        if self.root is not None:
             raise ValueError("Binary Tree is empty")
         n = self.root
         while n.left != None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....FF. [  5%]
.........F....F..FF.....                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...FFF.............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ......F.... [ 62%]
F...F......F....F.....                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py F.F. [ 84%]
.......F......F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:38: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f8258b586d0>

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:47: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:143: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
        assert var_6 == 'binary:(L:(L: False R:) False R:)'
        binary_node_0 = module_0.BinaryNode(var_5)
>       var_7 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:294: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:305: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.__iter__()
        var_4 = var_3.__repr__()
>       var_5 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:142: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: binary:() R:) binary:() R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:149: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f8258b64730>

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:156: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:68: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L: True R:)'
>       var_6 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:112: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is True
>       var_2 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        object_0 = module_1.object()
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:264: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_node_1.addToSubTree(binary_tree_0, bool_0)
        var_8 = module_0.BinaryNode(binary_tree_0)
>       var_9 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:373: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L:(L: True R:) True R:) True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        list_0 = [bool_0]
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(list_0)
        binary_tree_1 = module_0.BinaryTree()
        binary_tree_2 = module_0.BinaryTree()
        var_1 = binary_tree_2.__repr__()
        assert var_1 == 'binary:()'
        with pytest.raises(ValueError):
>           binary_tree_1.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:17: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L:(L: [] R:) [] R:) [] R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:107: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:200: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 18 failed, 99 passed in 0.41s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -108,7 +108,7 @@
 
     def getMax(self):
         """Returns maximum value."""
-        if self.root is None:
+        if self.root is not None:
             raise ValueError("Binary Tree is empty")
         n = self.root
         while n.right != None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ......F [  5%]
.....FFF.FF.FFFFFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
......FF...........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .......F... [ 62%]
F..FFFFF.FF.FFFFF.FFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F [ 84%]
........FFFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_6 __________________________________

    def test_case_6():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:52: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:95: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:106: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:145: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:166: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:195: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:213: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:248: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:270: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:288: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:307: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:331: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:350: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: True R:)) 3380 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:370: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:389: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -4493 R:(L: False R:(L: True R:)))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f36ecfb7c40>

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:169: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = module_0.BinaryTree()
        var_1 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:75: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:148: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:174: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:185: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: binary:() R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:246: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:278: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:298: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:312: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:340: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:414: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:(L: 1625 R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:442: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
>       var_7 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:463: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:(L: 1625 R:)))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
>       var_8 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:492: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
        var_1 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:44: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f36ece729b0>

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
        assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_0.value is True
        assert var_0.left is None
        assert var_0.right is None
        var_1 = binary_node_0.inorder()
        binary_tree_1 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_1.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:122: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:176: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 42 failed, 75 passed in 0.68s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -133,7 +133,7 @@
         Return value closest to target. If there are several, then
         return one of them.
         """
-        if self.root is None:
+        if self.root is not None:
             return None
         
         best = node = self.root

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
F....FF..F..FFFFF..FFFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...........FF......                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..F.F....F. [ 62%]
F..F...F..FFF.FFFFF.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
......F..FFF..F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:56: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.closest(var_2)
>       assert var_3 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:98: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:111: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:187: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:205: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:240: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:262: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:317: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:323: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:340: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:362: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:379: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        bool_0 = True
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.closest(bool_0)
>       assert var_1 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:195: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:36: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.closest(bool_0)
>       assert var_1 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        float_0 = 1747.362
        dict_0 = {float_0: float_0}
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(dict_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:87: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = {1747.362: 1747.362}

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:135: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_0)
>       assert var_3 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:204: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:237: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:272: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:306: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
>       var_2 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:358: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert None == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        bytes_0 = b'\xd5\x1aDT\x1bg\xd27\xd3\\\x13\xba'
        set_0 = {bytes_0, bytes_0, bytes_0}
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(set_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = {b'\xd5\x1aDT\x1bg\xd27\xd3\\\x13\xba'}

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_10
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 37 failed, 80 passed in 0.67s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -158,7 +158,7 @@
                 yield e
 
     def __repr__(self):
-        if self.root is None:
+        if self.root is not None:
             return "binary:()"
         return "binary:" + str(self.root)
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.FF......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...F...........F...                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..........F [ 62%]
F.....F..........F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py F... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        var_1 = binary_tree_0.__repr__()
>       assert var_1 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:64: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:()' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:()' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:136: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:213: AssertionError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:92: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
>       assert var_5 == 'binary:(L: True R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: True R:)'
E         - binary:(L: True R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:180: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
>       assert var_2 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
>       assert var_3 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:()' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        list_0 = [bool_0]
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(list_0)
        binary_tree_1 = module_0.BinaryTree()
        binary_tree_2 = module_0.BinaryTree()
        var_1 = binary_tree_2.__repr__()
>       assert var_1 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:15: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_10
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_0
======================== 18 failed, 99 passed in 0.51s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if not val <= self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F...... [  5%]
..F.......FFFF.FFF..FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py FF..F..F.F.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF........F...FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 34 failed, 83 passed in 0.46s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -22,7 +22,7 @@
 
     def addToSubTree(self, parent, val):
         """Add val to parent subtree (if exists) and return root of that subtree."""
-        if parent is None:
+        if not parent is None:
             return BinaryNode(val)
 
         parent.add(val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F.F.... [  5%]
..F......FFFFF.FFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py FF..F..F.F.. [ 36%]
...F...............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py FFF........ [ 62%]
F..F.F...FFFFFFFFFFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
.FF........F...FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
>       var_0 = binary_node_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:9: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 442 R:), parent = None, val = 442

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:25: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:75: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
        assert var_9 == 'binary:(L: False R:)'
>       var_10 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = 451

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
>       var_6 = binary_tree_0.add(var_5)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:171: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:182: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:194: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:212: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:247: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:269: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:287: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:304: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:330: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:346: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 3380 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:385: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -4493 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:10: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:139: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: binary:() R:), parent = None, val = 'binary:()'

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:11: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:29: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        object_0 = module_1.object()
        var_3 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:43: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:107: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:133: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:224: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
>       var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:239: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: None R:), parent = None, val = (L: None R:)

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        object_0 = module_1.object()
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:262: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_5).__module__}.{type(var_5).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:281: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:289: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:317: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:337: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
>       var_3 = binary_node_0.addToSubTree(var_2, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:360: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:388: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:412: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:439: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:457: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -2656 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:483: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 1656 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.add(list_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:29: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: [] R:), parent = None, val = []

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       var_1 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:55: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       var_1 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:71: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:209: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -995 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:216: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 47 failed, 70 passed in 0.81s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if not val < self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ....FF.F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF.....F.........                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'X>'
        str_1 = 'qkr(Szzyf\t'
        binary_node_0 = module_0.BinaryNode(str_1)
        var_0 = binary_node_0.remove(str_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:54: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
======================== 13 failed, 104 passed in 0.32s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -37,7 +37,7 @@
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
-            if self.left is None:
+            if not self.left is None:
                 return self.right
 
             child = self.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
....F.....F.F........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ...FF..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF.....F....FF.FF.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF...............                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_11 _________________________________

    def test_case_11():
        bool_0 = False
        list_0 = [bool_0, bool_0]
        binary_node_0 = module_0.BinaryNode(list_0)
>       var_0 = binary_node_0.remove(list_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:87: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: [False, False] R:), val = [False, False]

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.add(var_5)
>       var_7 = binary_tree_0.remove(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:198: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L:(L: True R:) True R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:33: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:104: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
>       var_2 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:124: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
        assert var_5 == 427
>       var_6 = binary_tree_0.remove(var_5)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 427 R:), val = 427

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:314: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
>       var_7 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:342: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 427 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
>       var_5 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:391: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 427 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
>       var_3 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:416: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:(L: 1625 R:)), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
>       var_8 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:465: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 1625 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:54: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:70: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
======================== 20 failed, 97 passed in 0.45s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -41,7 +41,7 @@
                 return self.right
 
             child = self.left
-            while child.right:
+            while not child.right:
                 child = child.right
             
             childKey = child.value;

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F.... [  5%]
..F.......F.....FFF..F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ....F..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
...F................F.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF...............                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.remove(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:26: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) False R:)'
>       var_5 = binary_tree_0.remove(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:78: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
>       var_7 = binary_tree_0.remove(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:172: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.remove(var_6)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:276: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: True R:) True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
        assert var_6 == 'binary:(L:(L: False R:) False R:)'
        binary_node_0 = module_0.BinaryNode(var_5)
        var_7 = binary_tree_0.getMin()
        assert var_7 is False
>       var_8 = binary_tree_0.remove(var_4)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_2.__repr__()
        binary_node_0 = module_0.BinaryNode(var_5)
        var_6 = binary_tree_0.add(var_0)
        var_7 = binary_tree_0.getMin()
>       var_8 = binary_tree_0.remove(var_7)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:313: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L:(L: False R:) False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:)) False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: True R:(L: 3380 R:)) False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:41: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: True R:) True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:72: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.remove(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:13: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
>       var_3 = binary_node_0.remove(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
>       var_11 = var_9.remove(var_7)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:469: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) 1625 R:), val = 1625

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
>       var_4 = binary_node_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:60: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: True R:) True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:73: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: True R:) True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
======================== 14 failed, 103 passed in 0.39s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -53,7 +53,7 @@
     def removeFromParent(self, parent, val):
         """Helper method for remove. Ensures proper behavior when removing node that 
         has children."""
-        if parent:
+        if not parent:
             return parent.remove(val)
         return None
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......F..............F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ..F.FFFF.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...F......F.......F.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
........F........F                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
        var_4 = binary_tree_0.closest(var_2)
        assert var_4 is False
        var_5 = var_2.__repr__()
>       var_6 = binary_tree_0.remove(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:113: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: 3380 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:24: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'X>'
        str_1 = 'qkr(Szzyf\t'
        binary_node_0 = module_0.BinaryNode(str_1)
>       var_0 = binary_node_0.remove(str_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:53: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:36: in remove
    self.left = self.removeFromParent(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: qkr(Szzyf	 R:), parent = None, val = 'X>'

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(bool_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:64: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = False, val = False

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'bool' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
        var_8 = var_3.__repr__()
        assert var_8 == '(L: False R:(L: True R:))'
>       object_0 = binary_node_0.removeFromParent(var_5, var_5)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: True R:)), parent = None, val = None

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.remove(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:248: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:36: in remove
    self.left = self.removeFromParent(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = False

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert 1625 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert 1656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_node_0.remove(bool_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:114: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:36: in remove
    self.left = self.removeFromParent(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = False

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
>       var_0 = binary_node_0.remove(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:225: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 112.342 R:), parent = None, val = 2683

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
======================== 14 failed, 103 passed in 0.32s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -61,7 +61,7 @@
         """Useful debugging function to produce linear tree representation."""
         leftS = ''
         rightS = ''
-        if self.left:
+        if not self.left:
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L:None None R:)' == '(L: None R:)'
E         - (L: None R:)
E         ?    -
E         + (L:None None R:)
E         ?         +++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:16: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L:None None R:)' == '(L: None R:)'
E         - (L: None R:)
E         ?    -
E         + (L:None None R:)
E         ?         +++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:32: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:None False R:)
E         ?           ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:None False R:)
E         ?           ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:(L:No...(L: True R:))' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         ?                       ---      ---------
E         + binary:(L:None False R:(L: True R:))
E         ?           ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: 3380 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:(L:No...L: True R:)))' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         ?                                   ---     ---------
E         + binary:(L:None -4493 R:(L:None False R:(L: True R:)))
E         ?           ++++            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_0.__repr__()
>       assert var_3 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L:None Fals...one True R:))' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L:None False R:(L:None True R:))
E         ?    ++++            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:89: AssertionError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: False R:)'
E       AssertionError: assert '(L:None False R:)' == '(L: False R:)'
E         - (L: False R:)
E         + (L:None False R:)
E         ?    ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:97: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
>       assert var_1 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L: True R:)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L: True R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:106: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L:None None R:)' == '(L: None R:)'
E         - (L: None R:)
E         ?    -
E         + (L:None None R:)
E         ?         +++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:50: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
>       assert var_5 == 'binary:(L: True R:)'
E       AssertionError: assert 'binary:(L:None True R:)' == 'binary:(L: True R:)'
E         - binary:(L: True R:)
E         + binary:(L:None True R:)
E         ?           ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
        var_8 = var_3.__repr__()
>       assert var_8 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L:None Fals...one True R:))' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L:None False R:(L:None True R:))
E         ?    ++++            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:152: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
>       assert var_4 == '(L:(L: False R:) False R:)'
E       AssertionError: assert '(L: False R:)' == '(L:(L: False R:) False R:)'
E         - (L:(L: False R:) False R:)
E         + (L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:297: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
>       assert var_2 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:None False R:)
E         ?           ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
>       assert var_3 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:None False R:)
E         ?           ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:No...ne False R:))' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:None -2656 R:(L:None False R:))
E         ?           ++++            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
>       assert var_2 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L: True R:)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L: True R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: False R:)'
E       AssertionError: assert '(L:None False R:)' == '(L: False R:)'
E         - (L: False R:)
E         + (L:None False R:)
E         ?    ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:94: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_node_0.__repr__()
>       assert var_6 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L: True R:)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L: True R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:182: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.__repr__()
>       assert var_1 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L:None Fals...one True R:))' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L:None False R:(L:None True R:))
E         ?    ++++            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:219: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.47s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -63,7 +63,7 @@
         rightS = ''
         if self.left:
             leftS = str(self.left)
-        if self.right:
+        if not self.right:
             rightS = str(self.right)
         return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L: None R:None)' == '(L: None R:)'
E         - (L: None R:)
E         + (L: None R:None)
E         ?            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:16: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L: None R:None)' == '(L: None R:)'
E         - (L: None R:)
E         + (L: None R:None)
E         ?            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:32: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L:(L...False R:None)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:(L:(L: False R:None) False R:None)
E         ?                       ++++          ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L: False R:None)
E         ?                    ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L: False R:None)
E         ?                    ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L:(L...False R:None)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:(L:(L: False R:None) False R:None)
E         ?                       ++++          ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L... 3380 R:None)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         ?                     -----------   -
E         + binary:(L:(L: False R:) 3380 R:None)
E         ?                                ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:(L: -4493 R:)' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         + binary:(L: -4493 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_0.__repr__()
>       assert var_3 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L: False R:)' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:89: AssertionError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: False R:)'
E       AssertionError: assert '(L: False R:None)' == '(L: False R:)'
E         - (L: False R:)
E         + (L: False R:None)
E         ?             ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:97: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
>       assert var_1 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L:(L: True ... True R:None)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L:(L: True R:None) True R:None)
E         ?               ++++         ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:106: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L: None R:None)' == '(L: None R:)'
E         - (L: None R:)
E         + (L: None R:None)
E         ?            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:50: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
>       assert var_5 == 'binary:(L: True R:)'
E       AssertionError: assert 'binary:(L: True R:None)' == 'binary:(L: True R:)'
E         - binary:(L: True R:)
E         + binary:(L: True R:None)
E         ?                   ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
        var_8 = var_3.__repr__()
>       assert var_8 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L: False R:)' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:152: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
>       assert var_4 == '(L:(L: False R:) False R:)'
E       AssertionError: assert '(L:(L: False...False R:None)' == '(L:(L: False R:) False R:)'
E         - (L:(L: False R:) False R:)
E         + (L:(L: False R:None) False R:None)
E         ?                ++++          ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:297: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
>       assert var_2 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L: False R:None)
E         ?                    ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
>       assert var_3 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L: False R:None)
E         ?                    ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L:(L... 1656 R:None)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L:(L: False R:None) 1656 R:None)
E         ?                       ++++         ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
>       assert var_2 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L:(L: True ... True R:None)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L:(L: True R:None) True R:None)
E         ?               ++++         ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: False R:)'
E       AssertionError: assert '(L: False R:None)' == '(L: False R:)'
E         - (L: False R:)
E         + (L: False R:None)
E         ?             ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:94: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_node_0.__repr__()
>       assert var_6 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L:(L: True ... True R:None)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L:(L: True R:None) True R:None)
E         ?               ++++         ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:182: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.__repr__()
>       assert var_1 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L: False R:)' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:219: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.45s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -69,7 +69,7 @@
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""
-        if self.left:
+        if not self.left:
             for v in self.left.inorder():
                 yield v
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -75,7 +75,7 @@
 
         yield self.value
 
-        if self.right:
+        if not self.right:
             for v in self.right.inorder():
                 yield v
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -87,7 +87,7 @@
    
     def add(self, value):
         """Insert value into proper location in Binary Tree."""
-        if self.root is None:
+        if not self.root is None:
             self.root = BinaryNode(value)
         else:
             self.root.add(value)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F.F.. [  5%]
.FF..FFF.FF.FFFFFFFFFFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ..........FF [ 36%]
FF.FF.F.FF.F.F..F..                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .FF.F...... [ 62%]
F.FFFFFF.FFFFFFFFFFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .FFF [ 84%]
.........FFF..F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:23: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:36: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        var_1 = binary_tree_0.__repr__()
        assert var_1 == 'binary:()'
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:65: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:73: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:104: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:119: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:140: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:190: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:208: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
>       var_3 = binary_tree_0.add(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:225: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:243: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:265: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:285: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:302: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:318: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:326: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:344: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 3380

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:365: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:383: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = -4493

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:115: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:120: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:125: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:137: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:147: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
>       var_0 = binary_tree_0.add(set_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:174: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = {binary:()}

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        bool_0 = True
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:192: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:217: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:27: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:39: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:55: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:100: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:146: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:158: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:171: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:183: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:197: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:220: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:244: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:257: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:275: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:293: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:309: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:333: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
>       var_4 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:365: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:382: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:408: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:433: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
>       var_1 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:452: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = -2656

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:481: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 1656

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:21: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(list_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:27: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = []

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
>       var_1 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:42: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:128: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:147: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:170: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:195: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_10
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 63 failed, 54 passed in 0.97s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -94,7 +94,7 @@
 
     def remove(self, val):
         """Remove value from tree."""
-        if self.root:
+        if not self.root:
             self.root = self.root.remove(val)
 
     def getMin(self):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F..F. [  5%]
..F......FF...F..F...F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
..F................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .....F..... [ 62%]
F.F...........F.F.....                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:20: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:45: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:70: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:137: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:223: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:282: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:130: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'j_XwI\'J"{^zfX[y'
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(str_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:63: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = 'j_XwI\'J"{^zfX[y'

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_tree_0.remove(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:357: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = False

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
>       var_0 = binary_tree_0.remove(float_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:41: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = -1660.53234

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
======================== 15 failed, 102 passed in 0.43s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -99,7 +99,7 @@
 
     def getMin(self):
         """Returns minimum value."""
-        if self.root is None:
+        if not self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
         while n.left != None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....FF. [  5%]
.........F....F..FF.....                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...FFF.............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ......F.... [ 62%]
F...F......F....F.....                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py F.F. [ 84%]
.......F......F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:38: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fcb64268820>

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:47: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:143: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
        assert var_6 == 'binary:(L:(L: False R:) False R:)'
        binary_node_0 = module_0.BinaryNode(var_5)
>       var_7 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:294: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:305: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.__iter__()
        var_4 = var_3.__repr__()
>       var_5 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:142: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: binary:() R:) binary:() R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:149: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fcb641249d0>

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:156: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:68: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L: True R:)'
>       var_6 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:112: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is True
>       var_2 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        object_0 = module_1.object()
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:264: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_node_1.addToSubTree(binary_tree_0, bool_0)
        var_8 = module_0.BinaryNode(binary_tree_0)
>       var_9 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:373: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L:(L: True R:) True R:) True R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        list_0 = [bool_0]
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(list_0)
        binary_tree_1 = module_0.BinaryTree()
        binary_tree_2 = module_0.BinaryTree()
        var_1 = binary_tree_2.__repr__()
        assert var_1 == 'binary:()'
        with pytest.raises(ValueError):
>           binary_tree_1.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:17: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L:(L: [] R:) [] R:) [] R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:107: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:200: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 18 failed, 99 passed in 0.41s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -102,7 +102,7 @@
         if self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
-        while n.left != None:
+        while not n.left != None:
             n = n.left
         return n.value
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....F.. [  5%]
.........F....F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
....F..............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F...F.................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:38: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f5d72e6c7f0>

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:143: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:149: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f5d72d130a0>

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L: True R:)'
>       var_6 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:112: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is True
>       var_2 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:200: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 7 failed, 110 passed in 0.28s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -108,7 +108,7 @@
 
     def getMax(self):
         """Returns maximum value."""
-        if self.root is None:
+        if not self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
         while n.right != None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ......F [  5%]
.....FFF.FF.FFFFFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
......FF...........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .......F... [ 62%]
F..FFFFF.FF.FFFFF.FFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F [ 84%]
........FFFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_6 __________________________________

    def test_case_6():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:52: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:95: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:106: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:145: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:166: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:195: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:213: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:248: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:270: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:288: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:307: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:331: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:350: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: True R:)) 3380 R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:370: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:389: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -4493 R:(L: False R:(L: True R:)))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fd94544b340>

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:169: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = module_0.BinaryTree()
        var_1 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:75: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:148: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:174: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:185: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: binary:() R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:246: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:278: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:298: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:312: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:340: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:414: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:(L: 1625 R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:442: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
>       var_7 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:463: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:(L: 1625 R:)))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
>       var_8 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:492: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
        var_1 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:44: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fd9454499c0>

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
        assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_0.value is True
        assert var_0.left is None
        assert var_0.right is None
        var_1 = binary_node_0.inorder()
        binary_tree_1 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_1.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:122: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:176: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 42 failed, 75 passed in 0.65s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -111,7 +111,7 @@
         if self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
-        while n.right != None:
+        while not n.right != None:
             n = n.right
         return n.value
     

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FFF.FF.FFFFFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
......F............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F..FFFFF.FF.FFFFF.FFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:95: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:106: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:145: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:166: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:288: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:307: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:350: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: True R:)) 3380 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
>       assert var_6 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:390: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fc926152020>

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:148: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:185: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: binary:() R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:246: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:278: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:312: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
>       assert var_7 == 1625
E       assert -2656 == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:464: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
>       var_8 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:492: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
        var_1 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:44: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fc92611fa30>

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:176: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 38 failed, 79 passed in 0.69s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -118,7 +118,7 @@
     def __contains__(self, target):
         """Check whether BST contains target value."""
         node = self.root
-        while node:
+        while not node:
             if target < node.value :
                 node = node.left
             elif target > node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F.... [  5%]
F.F..FFF.FF.FFFFFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F.F........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py FFF.....F.. [ 62%]
...F.F.FFFFFFFFFFFFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:21: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:71: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:91: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:117: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:188: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:206: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:221: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:241: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:263: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:283: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:300: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:324: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:341: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:363: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:380: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:186: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:8: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:24: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:34: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:79: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:130: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:168: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:209: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:216: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:234: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:252: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:270: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:286: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:304: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:326: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:354: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:429: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:449: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:476: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:193: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 44 failed, 73 passed in 0.80s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if not target < node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...F.FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......FF...........FF.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
.........FF...F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 21 failed, 96 passed in 0.42s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -133,7 +133,7 @@
         Return value closest to target. If there are several, then
         return one of them.
         """
-        if self.root is None:
+        if not self.root is None:
             return None
         
         best = node = self.root

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
F....FF..F..FFFFF..FFFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...........FF......                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..F.F....F. [ 62%]
F..F...F..FFF.FFFFF.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
......F..FFF..F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:56: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.closest(var_2)
>       assert var_3 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:98: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:111: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:187: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:205: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:240: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:262: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:317: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:323: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:340: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:362: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:379: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        bool_0 = True
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.closest(bool_0)
>       assert var_1 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:195: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:36: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.closest(bool_0)
>       assert var_1 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        float_0 = 1747.362
        dict_0 = {float_0: float_0}
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(dict_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:87: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = {1747.362: 1747.362}

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:135: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_0)
>       assert var_3 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:204: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:237: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:272: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:306: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
>       var_2 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:358: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert None == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        bytes_0 = b'\xd5\x1aDT\x1bg\xd27\xd3\\\x13\xba'
        set_0 = {bytes_0, bytes_0, bytes_0}
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(set_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = {b'\xd5\x1aDT\x1bg\xd27\xd3\\\x13\xba'}

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_10
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 37 failed, 80 passed in 0.60s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -138,7 +138,7 @@
         
         best = node = self.root
         distance = abs(self.root.value - target)
-        while node:
+        while not node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...............FF.....FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...............F.FF.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert 427 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert 427 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert 1625 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert 1656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 9 failed, 108 passed in 0.31s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if not abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.15s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if not target < node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............FFF.....FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
..............F.....F.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 10 failed, 107 passed in 0.31s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -153,7 +153,7 @@
 
     def __iter__(self):
         """In order traversal of elements in the tree."""
-        if self.root:
+        if not self.root:
             for e in self.root.inorder():
                 yield e
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........F...............                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
..............F....                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
........F.............                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FF.......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       object_0 = module_1.object(*var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:132: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def __iter__(self):
        """In order traversal of elements in the tree."""
        if not self.root:
>           for e in self.root.inorder():
E           AttributeError: 'NoneType' object has no attribute 'inorder'

binarySearchTree1.py:157: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
>       object_0 = module_1.object(*binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:208: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def __iter__(self):
        """In order traversal of elements in the tree."""
        if not self.root:
>           for e in self.root.inorder():
E           AttributeError: 'NoneType' object has no attribute 'inorder'

binarySearchTree1.py:157: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       object_0 = module_1.object(*binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:211: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def __iter__(self):
        """In order traversal of elements in the tree."""
        if not self.root:
>           for e in self.root.inorder():
E           AttributeError: 'NoneType' object has no attribute 'inorder'

binarySearchTree1.py:157: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
        assert var_3 is True
        binary_tree_1 = module_0.BinaryTree()
>       object_0 = module_1.object(*binary_tree_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:141: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def __iter__(self):
        """In order traversal of elements in the tree."""
        if not self.root:
>           for e in self.root.inorder():
E           AttributeError: 'NoneType' object has no attribute 'inorder'

binarySearchTree1.py:157: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
        assert var_3 is True
        binary_tree_1 = module_0.BinaryTree()
>       object_0 = module_1.object(*binary_tree_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def __iter__(self):
        """In order traversal of elements in the tree."""
        if not self.root:
>           for e in self.root.inorder():
E           AttributeError: 'NoneType' object has no attribute 'inorder'

binarySearchTree1.py:157: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
======================== 5 failed, 112 passed in 0.22s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -158,7 +158,7 @@
                 yield e
 
     def __repr__(self):
-        if self.root is None:
+        if not self.root is None:
             return "binary:()"
         return "binary:" + str(self.root)
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.FF......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...F...........F...                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..........F [ 62%]
F.....F..........F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py F... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        var_1 = binary_tree_0.__repr__()
>       assert var_1 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:64: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:()' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:()' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:136: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:213: AssertionError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:92: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
>       assert var_5 == 'binary:(L: True R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: True R:)'
E         - binary:(L: True R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:180: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
>       assert var_2 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
>       assert var_3 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:()' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        list_0 = [bool_0]
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(list_0)
        binary_tree_1 = module_0.BinaryTree()
        binary_tree_2 = module_0.BinaryTree()
        var_1 = binary_tree_2.__repr__()
>       assert var_1 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:15: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_10
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_0
======================== 18 failed, 99 passed in 0.43s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -124,7 +124,7 @@
             elif target > node.value:
                 node = node.right
             else:
-                return True
+                return False
                 
         return False
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.......F.........FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 22 failed, 95 passed in 0.41s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -126,7 +126,7 @@
             else:
                 return True
                 
-        return False
+        return True
 
     def closest(self, target):
         """

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F.... [  5%]
F.F..FFF.FF.FFFFFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
..........F........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py FFF.....F.. [ 62%]
...F.FF.FFFFFFFFF..FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FF...F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:22: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:72: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:92: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:103: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:118: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:139: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:161: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:189: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:207: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:222: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:242: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:264: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:284: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:301: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:325: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:342: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:364: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:381: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:187: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:9: AssertionError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:25: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:35: AssertionError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:80: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:131: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:169: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:217: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:235: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:253: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:287: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:305: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:327: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:355: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:430: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:450: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:477: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:194: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 42 failed, 75 passed in 0.70s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -70,7 +70,7 @@
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""
         if self.left:
-            for v in self.left.inorder():
+            for v in []:
                 yield v
 
         yield self.value

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.16s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -76,7 +76,7 @@
         yield self.value
 
         if self.right:
-            for v in self.right.inorder():
+            for v in []:
                 yield v
 
 class BinaryTree:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.17s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -154,7 +154,7 @@
     def __iter__(self):
         """In order traversal of elements in the tree."""
         if self.root:
-            for e in self.root.inorder():
+            for e in []:
                 yield e
 
     def __repr__(self):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.23s ==============================